Small Turing machines and generalized busy beaver competition
نویسندگان
چکیده
منابع مشابه
Small Turing machines and generalized busy beaver competition
Let TM(k, l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem is decidable for machines in TM(2, 3) and TM(3, 2). We prove that the decidability of machines in TM(2, 4) and TM(3, 3) will be difficult to settle, by giving machines in these sets for which the halting problem depends on an open problem in number theory. A machine in TM(5, 2) ...
متن کاملA Busy Beaver Problem for Infinite-Time Turing Machines
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning the growth rate of an associated function. In our view, these results indicate that the generalization is both natural and promising.
متن کاملRecombinations of Busy Beaver Machines
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed by human beings. We have only discovered them. In this paper, using well-known Busy Beaver and Placid Platypus machines, we generate further very similar, but not exactly the same machines. We have found a recombinate...
متن کاملThe Busy Beaver Competition: a historical survey
Tibor Rado defined the Busy Beaver Competition in 1962. He used Turing machines to give explicit definitions for some functions that are not computable and grow faster than any computable function. He put forward the problem of computing the values of these functions on numbers 1, 2, 3, . . .. More and more powerful computers have made possible the computation of lower bounds for these values. ...
متن کاملBusy Beaver Machines and the Observant Otter Heuristic
The busy beaver problem is to find the maximum number of non-zero characters that can be printed by an n-state Turing machine of a particular type. A critical step in the solution of this problem is to determine whether or not a given n-state Turing machine halts on a blank input. Given the enormous output sizes that can be produced by some small machines, it becomes critical to have appropriat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.05.008